#include <iostream>
#include <algorithm>
using namespace std;

bool cmp(int a, int b)
{
    return a > b;
}

int main()
{
    ios::sync_with_stdio(false);
    int testcases;
    int numbers[1010] = {0};
    int N, i, j;
    long sum;
    bool found;
    cin >> testcases;
    while (testcases--)
    {
        sum = 0;
        cin >> N;
        for (i = 0; i < N; i++)
        {
            cin >> numbers[i];
            sum += numbers[i];
        }
        //和为奇数非图
        if(sum % 2)
        {
            found = false;
        }
        else
        {
            found = true;
            for (i = 0; i < N; i++)
            {
                //每次都排列为降序序列，减一后将首位置空
                sort(numbers, numbers + N, cmp);
                //如果全0（因为以及排过序了）就认为找到了，退出
                if (numbers[0] == 0)
                {
                    found = true;
                    break;
                }
                //将第一个数后的度数个数减一
                for (j = 0; j < numbers[0]; j++)
                {
                    numbers[j+1]--;
                    if (numbers[j+1] < 0)
                    {
                        found = false;
                        break;
                    }
                }
                numbers[0] = 0;
                if(found == false)
                {
                    break;
                }
            }
        }
        if (found)
        {
            cout << "yes" << endl;
        }
        else
        {
            cout << "no" << endl;
        }
    }
    return 0;
}